A New Approach to Communicating X-Machines Systems

نویسندگان

  • Horia Georgescu
  • Cristina Vertan
چکیده

This paper presents a new model for the speci cation of communicating X-machine systems (CXMS). In previous papers, systems of X-machines have been implemented in two ways: using an unique X-machine which simulates the concurrent behaviour of several processes [1], or using several X-machines which communicate through asynchronous channels [2]. This article introduces an X-machine system for which the communication between components is done through synchronous channels. The model supposes that each X-machine has a local memory, an input and an output tape. The X-machines act simultaneously. The states of each component of the system are partitioned into processing and communicating states. Passing messages between the X-machines involves only communicating states. It is shown that, taking advantage of the behaviour of X-machines, communication using channels may be implemented, thus providing a synchronous message passing.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Simulation and Verification of P Systems through Communicating X-machines P.Kefalas1, G.Eleftherakis1, M.Holcombe2 and M.Gheorghe2

The aim of this paper is to prove the suitability of a parallel distributed computational model, communicating X-machines, to simulate in a natural way a well established model of molecular computation, P systems, and to present some further benefits of the approach allowing us to check for some formal properties. A set of rules to transform any P system with symbol-objects into a communicating...

متن کامل

Simulation and verification of P systems through communicating X-machines.

The aim of this paper is to prove the suitability of a parallel distributed computational model, communicating X-machines, to simulate in a natural way a well established model of molecular computation, P systems, and to present some further benefits of the approach allowing us to check for some formal properties. A set of rules to transform any P system with symbol-objects into a communicating...

متن کامل

Communicating X-Machines: From Theory to Practice

Formal modeling of complex systems is a non-trivial task, especially if a formal method does not facilitate separate development of the components of a system. This paper describes a methodology of building communicating Xmachines from existing stand-alone X-machine models and presents the theory that drives this methodology. A X-machine is a formal method that resembles a finite state machine ...

متن کامل

Communicating X-machines: a practical approach for formal and modular specification of large systems

An X-machine is a general computational machine that can model: (a) non-trivial data structures as a typed memory tuple and (b) the dynamic part of a system by employing transitions, which are not labeled with simple inputs but with functions that operate on inputs and memory values. The X-machine formal method is valuable to software engineers since it is rather intuitive, while at the same ti...

متن کامل

Communicating Stream X-Machines Systems are no more than X-Machines

A version of the communicating stream X-machine model is proposed, which gives a precise representation of the operation of transferring data from one X-machine to another. For this model it is shown that systems of communicating Xmachines have the same computational power as single stream X-machines. This enable existing methods for deriving test strategies for stream X-machines to be extended...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2000